//不同路径
class Solution {
public:
    int uniquePaths(int m, int n) {
        vector<vector<int>> dp(m + 1, vector<int>(n + 1));
        dp[0][1] = 1;
        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                dp[i][j] = dp[i][j - 1] + dp[i - 1][j];
            }
        }
        return dp[m][n];
    }
};

//最小路径和
class Solution {
public:
    int minPathSum(vector<vector<int>>& grid) {
        int m = grid.size();
        int n = grid[0].size();
        vector<vector<int>> dp(m + 1, vector<int>(n + 1, INT_MAX));

        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                int Min = min(dp[i][j - 1], dp[i - 1][j]);
                dp[i][j] = (Min == INT_MAX ? 0 : Min) + grid[i - 1][j - 1];
            }
        }

        return dp[m][n];
    }
};